On unimodular graphs
نویسندگان
چکیده
منابع مشابه
Dynamics on Unimodular Random Graphs
This paper is centered on covariant dynamics on random graphs and random networks (marked graphs), which can be described as rules to navigate the vertices that are preserved by graph/network isomorphisms. Such dynamics are referred to as vertex-shifts here. Unimodular random networks can be heuristically described as networks seen from a vertex chosen uniformly at random, both in the finite an...
متن کاملOn the representability of totally unimodular matrices on bidirected graphs
Seymour’s famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called k-sums starting from network matrices and their transposes and two compact representation matrices B1, B2 of a certain ten element matroid. Given that B1, B2 are binet matrices we examine the k-sums of network and binet m...
متن کاملConvergence, Unanimity and Disagreement in Majority Dynamics on Unimodular Graphs and Random Graphs
In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley graphs), when initial opinions are chosen from a distribution that is invariant with respect to the graph automorphism group, we show that the opinion of each age...
متن کاملApproximate inference using unimodular graphs in dual decomposition
We use the property of unimodular functions to perform approximate inference with dual decomposition in binary labeled graphs. Exact inference is possible for a subclass of binary labeled graphs that have unimodular functions. We call such graphs unimodular graphs. These are graphs where the submodular and nonsubmodular edges follow a specific pattern– essentially that an isomorphism or ”flippi...
متن کاملRegular Two-graphs from the Even Unimodular Lattice E8 + E8
This is a revised version of the rst part of 8]. Each two-graph is in one-to-one correspondence with a set of equiangular lines. This implies that a two-graph is represented by a system of vectors of equal odd norm with mutual inner products
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.10.017